Theorem Proving for Pointwise Metric Temporal Logic Over the Naturals via Translations
نویسندگان
چکیده
منابع مشابه
Theorem Proving for Metric Temporal Logic over the Naturals
We study translations from Metric Temporal Logic (MTL) over the natural numbers to Linear Temporal Logic (LTL). In particular, we present two approaches for translating from MTL to LTL which preserve the ExpSpace complexity of the satisfiability problem for MTL. In each of these approaches we consider the case where the mapping between states and time points is given by (1) a strict monotonic f...
متن کاملMetric Temporal Logic Translations over the Naturals
We study translations from Metric Temporal Logic (MTL) over the natural numbers to Linear Temporal Logic (LTL). In particular, we present two approaches for translating from MTL to LTL which preserve the EXPSPACE complexity of the satisfiability problem for MTL. Our translations, thus, allow us to utilise LTL provers to solve MTL satisfiability problems.
متن کاملTheorem-Proving for Discrete Temporal Logic
This chapter considers theorem proving for discrete temporal logics. We are interested in deciding or at least enumerating the formulas of the logic which are valid, that is, are true in all circumstances. Most of the techniques for temporal theorem-proving have been extensions for methods developed for classical logics but completely novel techniques have also been developed. Initially we conc...
متن کاملInteractive Theorem Proving with Temporal Logic
In this paper, we present a theorem prover for linear temporal logic. Our goal is to extend the capabilities of existing interactive and automatic systems for verifying temporal properties of software and hardware systems. We focus on increasing the eeectiveness of user interaction in such systems. In particular, we extend the techniques of proof by pointing and point and shoot for mouse-driven...
متن کاملLogic Control via Automatic Theorem Proving :
The COCOLOG system is a partially ordered family of rst order logical theories that describe the controlled evolution of the state of a given partially observered nite machine M. Following the review of the general theory of COCOLOG, the notion of Markovian fragments MTh k ,k 1, of full COCOLOG theories Th k is presented. These fragments enjoy the property of having axiom set of xed size over t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2020
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-020-09541-4